A Class of 2-Head Finite Automata for Linear Languages

Minimal Cover-Automata for Finite Languages

A cover-automaton A of a finite language L ⊆ Σ∗ is a finite automaton that accepts all words in L and possibly other words that are longer than any word in L. A minimal deterministic cover automaton of a finite language L usually has a smaller size than a minimal DFA that accept L. Thus, cover automata can be used to reduce the size of the representations of finite languages in practice. In thi...

Regular Languages and Finite Automata

Regular Languages and Finite Automata

In 1943, McCulloch and Pitts [4] published a pioneering work on a model for studying the behavior of the nervous systems. Following up on the ideas of McCulloch and Pitts, Kleene [3] wrote the first paper on finite automata and regular expressions. A finite automaton can be considered as the simplest machine model in that the machine has a finite memory; that is, the memory size is independent ...

A Class of P Automata for Characterizing Context-free Languages

Membrane systems, or P systems, are distributed computing models inspired by the functioning of the living cell. Their main components are membrane structures consisting of membranes hierarchically embedded in the outermost skin membrane. Each membrane encloses a region containing a multiset of objects and possibly other membranes. Each region has an associated set of operators working on the o...

Computing Bounded ǫ-Reach Set with Finite Precision Computations for a Class of Linear Hybrid Automata

In a previous paper [7] we have identified a special class of linear hybrid automata, called Deterministic Transversal Linear Hybrid Automata, and shown that an ǫ-reach set up to a finite time, called a bounded ǫ-reach set, can be computed using infinite precision calculations. However, given the linearity of the system and the consequent presence of matrix exponentials, numerical errors are in...